#include <algorithm>
#include <cstdio>
#include <cstring>
const int N = 20005;
int n, m;
int a[N], b[N];
int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
	freopen("testdata.in", "r", stdin);
	freopen("testdata.out", "w", stdout);
#endif
#ifndef LOCAL
	freopen("UVA11292.in", "r", stdin);
	freopen("UVA11292.out", "w", stdout);
#endif
#endif
	while (scanf("%d%d", &n, &m) != EOF && n != 0 && m != 0) {
		memset(a, 0, sizeof(a));
		memset(b, 0, sizeof(b));
		for (int i = 1; i <= n; ++i) { scanf("%d", &a[i]); }
		for (int i = 1; i <= m; ++i) { scanf("%d", &b[i]); }
		std::sort(a + 1, a + n + 1);
		std::sort(b + 1, b + m + 1);
		int cnt = 1, ans = 0;
		bool flag = false;
		for (int i = 1; i <= n; ++i) {
			while (b[cnt] < a[i] && cnt <= m + 1) ++cnt;
			if (cnt > m) {
				printf("Loowater is doomed!\n");
				flag = true;
				break;
			}
			ans += b[cnt++];
		}
		if (!flag) printf("%d\n", ans);
	}
	return 0;
}